Traduction et analyse de mots par intelligence artificielle ChatGPT
Sur cette page, vous pouvez obtenir une analyse détaillée d'un mot ou d'une phrase, réalisée à l'aide de la meilleure technologie d'intelligence artificielle à ce jour:
- comment le mot est utilisé
- fréquence d'utilisation
- il est utilisé plus souvent dans le discours oral ou écrit
- options de traduction de mots
- exemples d'utilisation (plusieurs phrases avec traduction)
- étymologie
Qu'est-ce (qui) est Constraint Handling In Prolog - définition
![Resolving the constraints of a rigid water molecule using [[Lagrange multipliers]]: a) the unconstrained positions are obtained after a simulation time-step, b) the [[gradients]] of each constraint over each particle are computed and c) the Lagrange multipliers are computed for each gradient such that the constraints are satisfied.](https://commons.wikimedia.org/wiki/Special:FilePath/SHAKE algorithm.png?width=200 "Resolving the constraints of a rigid water molecule using [[Lagrange multipliers]]: a) the unconstrained positions are obtained after a simulation time-step, b) the [[gradients]] of each constraint over each particle are computed and c) the Lagrange multipliers are computed for each gradient such that the constraints are satisfied.")
Wikipédia
Constraint Handling Rules (CHR) is a declarative, rule-based programming language, introduced in 1991 by Thom Frühwirth at the time with European Computer-Industry Research Centre (ECRC) in Munich, Germany. Originally intended for constraint programming, CHR finds applications in grammar induction, type systems, abductive reasoning, multi-agent systems, natural language processing, compilation, scheduling, spatial-temporal reasoning, testing, and verification.
A CHR program, sometimes called a constraint handler, is a set of rules that maintain a constraint store, a multi-set of logical formulas. Execution of rules may add or remove formulas from the store, thus changing the state of the program. The order in which rules "fire" on a given constraint store is non-deterministic, according to its abstract semantics and deterministic (top-down rule application), according to its refined semantics.
Although CHR is Turing complete, it is not commonly used as a programming language in its own right. Rather, it is used to extend a host language with constraints. Prolog is by far the most popular host language and CHR is included in several Prolog implementations, including SICStus and SWI-Prolog, although CHR implementations also exist for Haskell, Java, C, SQL, and JavaScript. In contrast to Prolog, CHR rules are multi-headed and are executed in a committed-choice manner using a forward chaining algorithm.
